Optimally solving a transportation problem using Voronoi diagrams

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimally Solving a Transportation Problem Using Voronoi Diagrams

We consider the following variant of the well-known Monge-Kantorovich transportation problem. Let S be a set of n point sites in R. A bounded set C ⊂ R is to be distributed among the sites p ∈ S such that (i), each p receives a subset Cp of prescribed volume and (ii), the average distance of all points z of C from their respective sites p is minimized. In our model, volume is quantified by a me...

متن کامل

Computing transportation Voronoi diagrams in optimal time

We present the first time-optimal algorithm for computing the Voronoi Diagram under the metric induced by a transportation network with discrete entry and exit points. For input with n sites, k stations, and e transportation lines, the algorithm computes the Voronoi Diagram in O ( (n+ k) log(n+ k) + e ) time.

متن کامل

Voronoi Diagrams with a Transportation Network on the Euclidean Plane

This paper investigates geometric and algorithmic properties of the Voronoi diagram with a transportation network on the Euclidean plane. With a transportation network, the distance is measured as the length of the shortest (time) path. In doing so, we introduce a needle, a generalized Voronoi site. We present an O(nm + m + nm log n) algorithm to compute the Voronoi diagram with a transportatio...

متن کامل

Diagrams and problem solving

The use of diagrams as external aids to facilitate cognitive abilities is not new. This paper looks into cognitive studies for insight into when, why and how diagrams are effective in problem solving. A case study examines the use of diagrammatic representations as thinking tools and tools for communicating information. The purpose is to examine whether diagramming could be used as a design met...

متن کامل

Image Processing using Voronoi diagrams

1 This work has been partially supported by grant TIN2005-08863-C03 of the Spanish Ministry of Science and Education 2 Corresponding address: [email protected] Abstract – In this paper we present some techniques for obtaining non-photorealistc images with the aid of Voronoi diagrams, such as stained-glass images. We also show examples of their potential applications, including lossy image ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Geometry

سال: 2013

ISSN: 0925-7721

DOI: 10.1016/j.comgeo.2013.05.005